Timing analysis for embedded systems using non-preemptive EDF scheduling under bounded error arrivals
نویسندگان
چکیده
منابع مشابه
Compiler Aided Ticket Scheduling (CATS) For Non-Preemptive Embedded Systems
A key challenge in designing realtime systems for nonpreemptive architectures is the timely guarantee of the execution of periodic tasks, together with non-periodic tasks. The main challenge of scheduling tasks in such systems results from the conflict between the requirement to execute periodic tasks at specific time intervals, versus the requirement to yield the CPU to non-periodic tasks. The...
متن کاملRevision of a Non-Preemptive EDF Packet Scheduling Algorithm
One issue with today’s Internet is that it only supports besteffort service; hence Internet users often experience unpredicted delay. Deployment of new real-time, highly reliable applications that require fixed delay bound on packets, such as remote surgery, become very difficult. Communication environment that can assert a strict delay bound will help estimate the worst-case execution time of ...
متن کاملPower-Aware Scheduling under Timing Constraints and Slack Analysis for Mission-Critical Embedded Systems
Power-aware systems are those that must make the best use of available power. They subsume traditional low-power systems in that they must not only minimize power when the budget is low, but also deliver higher performance when required. This paper presents a new scheduling technique for supporting the design and evaluation to a class of power-aware systems in mission critical applications. It ...
متن کاملAn Efficient Non-Preemptive Algorithm for Soft Real-Time Systems using Domain Cluster-Group EDF
In this paper a new non-preemptive domain clustering scheduling algorithm for soft real time application is proposed. The main aim of this algorithm is to achieve high deadline meeting ratio of the group Earliest Deadline First (gEDF) algorithm by maintaining the excellent performance during normal load. An efficient non-preemptive algorithm called Domain Cluster – group EDF (DC-gEDF) is propos...
متن کاملFrom non-preemptive to preemptive scheduling using synchronization synthesis
We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Computing and Informatics
سال: 2017
ISSN: 2210-8327
DOI: 10.1016/j.aci.2016.07.001